0.08/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.14 % Command : run_E %s %d THM 0.14/0.35 % Computer : n014.cluster.edu 0.14/0.35 % Model : x86_64 x86_64 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.35 % Memory : 8042.1875MB 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.35 % CPULimit : 960 0.14/0.35 % WCLimit : 120 0.14/0.35 % DateTime : Tue Aug 9 03:40:46 EDT 2022 0.14/0.35 % CPUTime : 0.21/0.48 Running higher-order on 8 cores theorem proving 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.21/0.48 # Version: 3.0pre003-ho 24.24/3.51 # Preprocessing class: HSMSSMSSSSSNHHA. 24.24/3.51 # Scheduled 6 strats onto 8 cores with 120 seconds (960 total) 24.24/3.51 # Starting full_lambda_6 with 360s (3) cores 24.24/3.51 # Starting post_as_ho1 with 120s (1) cores 24.24/3.51 # Starting lpo6_lambda_fix with 120s (1) cores 24.24/3.51 # Starting ho_unfolding_1 with 120s (1) cores 24.24/3.51 # Starting new_ho_10_unif with 120s (1) cores 24.24/3.51 # Starting ho_unfolding_2 with 120s (1) cores 24.24/3.51 # ho_unfolding_2 with pid 16724 completed with status 0 24.24/3.51 # Result found by ho_unfolding_2 24.24/3.51 # Preprocessing class: HSMSSMSSSSSNHHA. 24.24/3.51 # Scheduled 6 strats onto 8 cores with 120 seconds (960 total) 24.24/3.51 # Starting full_lambda_6 with 360s (3) cores 24.24/3.51 # Starting post_as_ho1 with 120s (1) cores 24.24/3.51 # Starting lpo6_lambda_fix with 120s (1) cores 24.24/3.51 # Starting ho_unfolding_1 with 120s (1) cores 24.24/3.51 # Starting new_ho_10_unif with 120s (1) cores 24.24/3.51 # Starting ho_unfolding_2 with 120s (1) cores 24.24/3.51 # No SInE strategy applied 24.24/3.51 # Search class: HGHNF-FFSF22-SHHFFSBN 24.24/3.51 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 24.24/3.51 # Starting new_ho_10_unif with 36s (1) cores 24.24/3.51 # new_ho_10_unif with pid 16733 completed with status 0 24.24/3.51 # Result found by new_ho_10_unif 24.24/3.51 # Preprocessing class: HSMSSMSSSSSNHHA. 24.24/3.51 # Scheduled 6 strats onto 8 cores with 120 seconds (960 total) 24.24/3.51 # Starting full_lambda_6 with 360s (3) cores 24.24/3.51 # Starting post_as_ho1 with 120s (1) cores 24.24/3.51 # Starting lpo6_lambda_fix with 120s (1) cores 24.24/3.51 # Starting ho_unfolding_1 with 120s (1) cores 24.24/3.51 # Starting new_ho_10_unif with 120s (1) cores 24.24/3.51 # Starting ho_unfolding_2 with 120s (1) cores 24.24/3.51 # No SInE strategy applied 24.24/3.51 # Search class: HGHNF-FFSF22-SHHFFSBN 24.24/3.51 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 24.24/3.51 # Starting new_ho_10_unif with 36s (1) cores 24.24/3.51 # Preprocessing time : 0.001 s 24.24/3.51 # Presaturation interreduction done 24.24/3.51 24.24/3.51 # Proof found! 24.24/3.51 # SZS status Theorem 24.24/3.51 # SZS output start CNFRefutation 24.24/3.51 thf(decl_22, type, epred1_0: a > a > $o). 24.24/3.51 thf(decl_23, type, esk1_0: (a > $o) > a). 24.24/3.51 thf(decl_24, type, esk2_2: (a > $o) > a > a). 24.24/3.51 thf(decl_25, type, esk3_0: a > a). 24.24/3.51 thf(cTHM145_A_pme, conjecture, ![X1:a > a > $o, X2:(a > $o) > a]:((![X3:a > a]:((?[X4:a]:(((X1 @ (X3 @ X4) @ X4)&(X1 @ X4 @ (X3 @ X4))))<=(![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X1 @ (X3 @ X5) @ (X3 @ X6))))&![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X1 @ (X3 @ X5) @ (X3 @ X6)))))))<=(![X7:a > $o]:(((![X8:a]:(((X7 @ X8)=>(X1 @ X8 @ (X2 @ X7))))&![X8:a]:(((X7 @ X8)=>(X1 @ X8 @ (X2 @ X7)))))&![X9:a]:((![X10:a]:(((X1 @ X10 @ X9)<=((X7 @ X10)&(X7 @ X10))))=>((X1 @ (X2 @ X7) @ X9)&(X1 @ (X2 @ X7) @ X9))))))&![X5:a, X6:a, X8:a]:((((X1 @ X5 @ X6)&(X1 @ X6 @ X8))=>(X1 @ X5 @ X8)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM145_A_pme)). 24.24/3.51 thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:(a > $o) > a]:(((![X7:a > $o]:((![X8:a]:(((X7 @ X8)=>(X1 @ X8 @ (X2 @ X7))))&![X9:a]:((![X10:a]:(((X7 @ X10)=>(X1 @ X10 @ X9)))=>(X1 @ (X2 @ X7) @ X9)))))&![X5:a, X6:a, X8:a]:((((X1 @ X5 @ X6)&(X1 @ X6 @ X8))=>(X1 @ X5 @ X8))))=>![X3:a > a]:((![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X1 @ (X3 @ X5) @ (X3 @ X6))))=>?[X4:a]:(((X1 @ (X3 @ X4) @ X4)&(X1 @ X4 @ (X3 @ X4))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145_A_pme])])). 24.24/3.51 thf(c_0_2, negated_conjecture, ![X29:a > $o, X30:a, X31:a, X33:a, X34:a, X35:a, X37:a, X38:a, X39:a]:(((((~(X29 @ X30)|(epred1_0 @ X30 @ (esk1_0 @ X29)))&(((X29 @ (esk2_2 @ X29 @ X31))|(epred1_0 @ (esk1_0 @ X29) @ X31))&(~(epred1_0 @ (esk2_2 @ X29 @ X31) @ X31)|(epred1_0 @ (esk1_0 @ X29) @ X31))))&(~(epred1_0 @ X33 @ X34)|~(epred1_0 @ X34 @ X35)|(epred1_0 @ X33 @ X35)))&((~(epred1_0 @ X37 @ X38)|(epred1_0 @ (esk3_0 @ X37) @ (esk3_0 @ X38)))&(~(epred1_0 @ (esk3_0 @ X39) @ X39)|~(epred1_0 @ X39 @ (esk3_0 @ X39)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 24.24/3.51 thf(c_0_3, negated_conjecture, ![X4:a, X5:a, X6:a]:(((epred1_0 @ X4 @ X6)|~((epred1_0 @ X4 @ X5))|~((epred1_0 @ X5 @ X6)))), inference(split_conjunct,[status(thm)],[c_0_2])). 24.24/3.51 thf(c_0_4, negated_conjecture, ![X4:a, X5:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk3_0 @ X5))|~((epred1_0 @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 24.24/3.51 thf(c_0_5, negated_conjecture, ![X4:a, X6:a, X5:a]:(((epred1_0 @ X4 @ (esk3_0 @ X5))|~((epred1_0 @ X4 @ (esk3_0 @ X6)))|~((epred1_0 @ X6 @ X5)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 24.24/3.51 thf(c_0_6, negated_conjecture, ![X7:a > $o, X4:a]:(((X7 @ (esk2_2 @ X7 @ X4))|(epred1_0 @ (esk1_0 @ X7) @ X4))), inference(split_conjunct,[status(thm)],[c_0_2])). 24.24/3.51 thf(c_0_7, negated_conjecture, ![X7:a > $o, X4:a]:(((epred1_0 @ X4 @ (esk1_0 @ X7))|~((X7 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 24.24/3.51 thf(c_0_8, negated_conjecture, ![X3:a > a, X4:a, X13:a > a, X5:a]:(((epred1_0 @ (X3 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0))))) @ X4)) @ (esk3_0 @ X5))|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0)))))) @ X4)|~((epred1_0 @ (X13 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0))))) @ X4)) @ X5)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 24.24/3.51 thf(c_0_9, negated_conjecture, ![X1:a > a > $o, X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0:a]:((X1 @ Z0 @ Z0))) @ X4) @ (esk1_0 @ (^[Z0:a]:((X1 @ Z0 @ Z0)))))|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((X1 @ Z0 @ Z0)))) @ X4))), inference(spm,[status(thm)],[c_0_7, c_0_6])). 24.24/3.51 thf(c_0_10, negated_conjecture, ![X7:a > $o, X4:a]:(((epred1_0 @ (esk1_0 @ X7) @ X4)|~((epred1_0 @ (esk2_2 @ X7 @ X4) @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 24.24/3.51 thf(c_0_11, negated_conjecture, ![X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))) @ X4) @ (esk3_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))))|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ X4))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 24.24/3.51 thf(c_0_12, negated_conjecture, ![X3:a > a, X4:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ (X3 @ Z0)))))))|~((epred1_0 @ X4 @ (X3 @ (esk3_0 @ X4)))))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 24.24/3.51 thf(c_0_13, negated_conjecture, (epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 24.24/3.51 thf(c_0_14, negated_conjecture, ![X4:a]:((~((epred1_0 @ (esk3_0 @ X4) @ X4))|~((epred1_0 @ X4 @ (esk3_0 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])). 24.24/3.51 thf(c_0_15, negated_conjecture, (epred1_0 @ (esk3_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 24.24/3.51 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']). 24.24/3.51 # SZS output end CNFRefutation 24.24/3.51 # Parsed axioms : 2 24.24/3.51 # Removed by relevancy pruning/SinE : 0 24.24/3.51 # Initial clauses : 7 24.24/3.51 # Removed in clause preprocessing : 1 24.24/3.51 # Initial clauses in saturation : 6 24.24/3.51 # Processed clauses : 865 24.24/3.51 # ...of these trivial : 128 24.24/3.51 # ...subsumed : 272 24.24/3.51 # ...remaining for further processing : 465 24.24/3.51 # Other redundant clauses eliminated : 0 24.24/3.51 # Clauses deleted for lack of memory : 0 24.24/3.51 # Backward-subsumed : 29 24.24/3.51 # Backward-rewritten : 47 24.24/3.51 # Generated clauses : 48580 24.24/3.51 # ...of the previous two non-redundant : 41700 24.24/3.51 # ...aggressively subsumed : 0 24.24/3.51 # Contextual simplify-reflections : 0 24.24/3.51 # Paramodulations : 48396 24.24/3.51 # Factorizations : 183 24.24/3.51 # NegExts : 0 24.24/3.51 # Equation resolutions : 1 24.24/3.51 # Propositional unsat checks : 0 24.24/3.51 # Propositional check models : 0 24.24/3.51 # Propositional check unsatisfiable : 0 24.24/3.51 # Propositional clauses : 0 24.24/3.51 # Propositional clauses after purity: 0 24.24/3.51 # Propositional unsat core size : 0 24.24/3.51 # Propositional preprocessing time : 0.000 24.24/3.51 # Propositional encoding time : 0.000 24.24/3.51 # Propositional solver time : 0.000 24.24/3.51 # Success case prop preproc time : 0.000 24.24/3.51 # Success case prop encoding time : 0.000 24.24/3.51 # Success case prop solver time : 0.000 24.24/3.51 # Current number of processed clauses : 383 24.24/3.51 # Positive orientable unit clauses : 92 24.24/3.51 # Positive unorientable unit clauses: 0 24.24/3.51 # Negative unit clauses : 15 24.24/3.51 # Non-unit-clauses : 276 24.24/3.51 # Current number of unprocessed clauses: 40342 24.24/3.51 # ...number of literals in the above : 125900 24.24/3.51 # Current number of archived formulas : 0 24.24/3.51 # Current number of archived clauses : 82 24.24/3.51 # Clause-clause subsumption calls (NU) : 11966 24.24/3.51 # Rec. Clause-clause subsumption calls : 10032 24.24/3.51 # Non-unit clause-clause subsumptions : 293 24.24/3.51 # Unit Clause-clause subsumption calls : 2671 24.24/3.51 # Rewrite failures with RHS unbound : 0 24.24/3.51 # BW rewrite match attempts : 2202 24.24/3.51 # BW rewrite match successes : 57 24.24/3.51 # Condensation attempts : 865 24.24/3.51 # Condensation successes : 9 24.24/3.51 # Termbank termtop insertions : 12460643 24.24/3.51 24.24/3.51 # ------------------------------------------------- 24.24/3.51 # User time : 2.904 s 24.24/3.51 # System time : 0.123 s 24.24/3.51 # Total time : 3.027 s 24.24/3.51 # Maximum resident set size: 1720 pages 24.24/3.51 24.24/3.51 # ------------------------------------------------- 24.24/3.51 # User time : 2.906 s 24.24/3.51 # System time : 0.125 s 24.24/3.51 # Total time : 3.030 s 24.24/3.51 # Maximum resident set size: 1732 pages 24.24/3.54 EOF